#include <iostream>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <unordered_set>
#include <unordered_map>
#include <functional>
#include <cmath>
#include <cstring>

using namespace std;

class Solution
{
public:
    int maxIncreasingSubarrays(vector<int> &nums)
    {
        int lastLen = 0, nowLen = 1;
        int idx = 1;
        int lastNum = nums[0];
        int ans = 0;
        while (idx < nums.size())
        {
            int n = nums[idx];
            if (n > lastNum)
            {
                nowLen++;
            }
            else // if (n <= lastNum)
            {
                ans = max(ans, min(nowLen, lastLen));
                ans = max(ans, nowLen / 2);
                lastLen = nowLen;
                nowLen = 1;
            }
            lastNum = n;
            ++idx;
        }
        ans = max(ans, min(nowLen, lastLen));
        ans = max(ans, nowLen / 2);
        return ans;
    }
};

int main()
{

    // system("pause");
    return 0;
}
